Aspiration Criteria Based Graph Clustering with Greedy Initialization
نویسندگان
چکیده
Clustering has an extensive and long history in a variety of scientific fields. Several recent studies of complex networks have suggested that the clustering analysis on networks has been an emerging research issue in data mining due to its variety of applications. Many graph clustering algorithms have been proposed in recent past, however, this clustering approach remains a challenging problem to solve real-world situation. In this work, we propose an aspiration criteria based graph clustering algorithm using stochastic local search for generating lower cost clustering results in terms of robustness and optimality for real-world complex network problems. In our proposed algorithm, all moves are meaningful and effective during the whole clustering process which indicates that moves are only accepted if the target node has neighbouring nodes in the destination cluster (moves to an empty cluster are the only exception to this instruction). An adaptive approach in our method is in incorporating the aspiration criteria for the best move (lower-cost changes) selection when the best non-tabu move involvements much higher cost compared to a tabued move then the tabued move is permitted otherwise the best non-tabu move is acceptable. Extensive experimentation with synthetic and real power-law distribution benchmark datasets show that our algorithm outperforms state-of-the-art graph clustering techniques on the basis of cost of clustering, cluster size, normalized mutual information (NMI) and modularity index of clustering results.
منابع مشابه
A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using K-Means as a local search procedure
We present a new approach for Cluster Analysis based on a Greedy Randomized Adaptive Search Procedure (GRASP), with the objective of overcoming the convergence to a local solution. It uses a probabilistic greedy Kaufman initialization to get initial solutions and K-Means as a local search algorithm. The approach is a new initialization one for K-Means. Hence, we compare it with some typical ini...
متن کاملAdaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
This paper presents some adaptive restart randomized greedy heuristics formaximum clique. The algorithms are based on improvements and variations of previously-studied algorithms by the authors. Three kinds of adaptation are studied: adaptation of the initial state (AI) given to the greedy heuristic, adaptation of vertex weights (AW) on the graph, and no adaptation (NA). Two kinds of initializa...
متن کاملA GRASP Algorithm for Clustering
We present a new approach for Cluster Analysis based on a Greedy Randomized Adaptive Search Procedure (GRASP), with the objective of overcoming the convergence to a local solution. It uses a probabilistic greedy Kaufman initialization for getting initial solutions and K-Means algorithm as a local search algorithm. We compare it with some typical initialization methods: Random, Forgy, Macqueen a...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملDECSAI A Greedy Randomized Adaptive Search Procedure for the Clustering Problem
The aim of this paper is to present a new proposal for Cluster Analysis based on a Greedy Randomized Adaptive Search Procedure (GRASP), with the objective of overcoming the convergence to a local solution. It uses a probabilistic greedy Kaufman initialization method for getting initial solutions and the K-Means algorithm as a local search algorithm. The new proposal will become a new initializa...
متن کامل